Recognizing Hamming graphs in linear time and space
نویسندگان
چکیده
منابع مشابه
Recognizing Hamming Graphs in Linear Time and space
Hamming graphs are, by definition, the Cartesian product of complete graphs. In the bipartite case these graphs are hypercubes. We present an algorithm recognizing Hamming graphs in linear time and space. This improves a previous algorithm which was linear in time but not in space. This also favorably compares to the general decomposition algorithms of graphs with respect to the Cartesian produ...
متن کاملRecognizing Outer 1-Planar Graphs in Linear Time
A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are on the outer face and each edge is crossed at most once. o1p graphs generalize outerplanar graphs, which can be recognized in linear time and specialize 1-planar graphs, whose recognition is NP-hard. Our main result is a linear-time algorithm that first tests whether a graph G is o1p, and then computes an...
متن کاملRecognizing Bipartite Unbounded Tolerance Graphs in Linear Time
A graph G = (V,E) is a tolerance graph if each vertex v ∈ V can be associated with an interval of the real line Iv and a positive real number tv in such a way that (uv) ∈ E if and only if |Iv ∩ Iu| ≥ min(tv, tu). No algorithm for recognizing tolerance graphs in general is known. In this paper we present an O(n+m) algorithm for recognizing tolerance graphs that are also bipartite, where n and m ...
متن کاملA simple O(mn) algorithm for recognizing Hamming graphs
We show that any isometric irredundant embedding of a graph into a product of complete graphs is the canonical isometric embedding. This result is used to design a simple O(mn) algorithm for recognizing Hamming graphs.
متن کاملLinear-time certifying algorithms for recognizing trivially perfect graphs
We give the first linear-time certifying algorithms to recognize trivially perfect graphs, with sublinear certificates for negative output. In case of membership in the class of trivially perfect graphs, our algorithms provide as certificate a structure for the input graph that characterizes the class, and in case of non-membership they provide as certificate a forbidden induced subgraph of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1997
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00095-1